﻿// Steps UVA - 846.cpp : 此文件包含 "main" 函数。程序执行将在此处开始并结束。
//
/*
https://vjudge.net/problem/UVA-846

One steps through integer points of the straight line. The length of a step must be nonnegative and
can be by one bigger than, equal to, or by one smaller than the length of the previous step.
What is the minimum number of steps in order to get from x to y? The length of the first and the
last step must be 1.
Input and Output
Input consists of a line containing n, the number of test cases. For each test case, a line follows with
two integers: 0 ≤ x ≤ y < 2
31. For each test case, print a line giving the minimum number of steps to
get from x to y.
Sample Input
3
45 48
45 49
45 50
Sample Output
3
3
4
*/
#include <iostream>

int main()
{
    std::cout << "Hello World!\n";
}
 